GATE CSE 2012


Q11.

The truth table represents the Boolean function
GateOverflow

Q12.

Given the basic ER and relational models, which of the following is INCORRECT?
GateOverflow

Q13.

A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is
GateOverflow

Q14.

How many onto (or surjective) functions are there from an n-element ( n \geq 2 ) set to a 2-element set?
GateOverflow

Q15.

Let A be the 2x2 matrix with elements a_{11}=a_{12}=a_{21}=+1 and a_{22}=-1. Then the eigenvalues of the matrix A^{19} are
GateOverflow

Q16.

The amount of ROM needed to implement a 4 bit multiplier is
GateOverflow

Q17.

Let G be a weighted graph with edge weights greater than one and G' be the graph constructed by squaring the weights of edges in G. Let T and T' be the minimum spanning trees of G and G', respectively, with total weights t and t'. Which of the following statements is TRUE?
GateOverflow

Q18.

What is the complement of the language accepted by the NFA shown below? Assume \sum={a} and \varepsilon is the empty string.
GateOverflow

Q19.

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
GateOverflow

Q20.

The decimal value 0.5 in IEEE single precision floating point representation has
GateOverflow